11,792 research outputs found

    Computing New Optimized Routes for GPS Navigators Using Evolutionary Algorithms

    Get PDF
    GPS navigators are now present in most vehicles and smartphones. The usual goal of these navigators is to take the user in less time or distance to a destination. However, the global use of navigators in a given city could lead to traffic jams as they have a highly biased preference for some streets. From a general point of view, spreading the traffic throughout the city could be a way of preventing jams and making a better use of public resources. We propose a way of calculating alternative routes to be assigned by these devices in order to foster a better use of the streets. Our experimentation involves maps from OpenStreetMap, real road traffic, and the microsimulator SUMO. We contribute to reducing travel times, greenhouse gas emissions, and fuel consumption. To analyze the sociological aspect of any innovation, we analyze the penetration (acceptance) rate which shows that our proposal is competitive even when just 10% of the drivers are using it.Spanish MINECO project TIN2014-57341-R (http://moveon.lcc.uma.es). FPU grant (FPU13/00954) from the Spanish Ministry of Education, Culture and Sports. University of Malaga. International Campus of Excellence Andalucia TECH

    Red Swarm: Smart Mobility in Cities with EAs

    Get PDF
    This work presents an original approach to regulate traffic by using an on-line system controlled by an EA. Our proposal uses computational spots with WiFi connectivity located at traffic lights (the Red Swarm), which are used to suggest alternative individual routes to vehicles. An evolutionary algorithm is also proposed in order to find a configuration for the Red Swarm spots which reduces the travel time of the vehicles and also prevents traffic jams. We solve real scenarios in the city of Malaga (Spain), thus enriching the OpenStreetMap info by adding traffic lights, sensors, routes and vehicle flows. The result is then imported into the SUMO traffic simulator to be used as a method for calculating the fitness of solutions. Our results are competitive compared to the common solutions from experts in terms of travel and stop time, and also with respect to other similar proposals but with the added value of solving a real, big instance.Ministerio de Economía y Competitividad y FEDER (TIN2011-28194

    Approximation of tensor fields on surfaces of arbitrary topology based on local Monge parametrizations

    Full text link
    We introduce a new method, the Local Monge Parametrizations (LMP) method, to approximate tensor fields on general surfaces given by a collection of local parametrizations, e.g.~as in finite element or NURBS surface representations. Our goal is to use this method to solve numerically tensor-valued partial differential equations (PDE) on surfaces. Previous methods use scalar potentials to numerically describe vector fields on surfaces, at the expense of requiring higher-order derivatives of the approximated fields and limited to simply connected surfaces, or represent tangential tensor fields as tensor fields in 3D subjected to constraints, thus increasing the essential number of degrees of freedom. In contrast, the LMP method uses an optimal number of degrees of freedom to represent a tensor, is general with regards to the topology of the surface, and does not increase the order of the PDEs governing the tensor fields. The main idea is to construct maps between the element parametrizations and a local Monge parametrization around each node. We test the LMP method by approximating in a least-squares sense different vector and tensor fields on simply connected and genus-1 surfaces. Furthermore, we apply the LMP method to two physical models on surfaces, involving a tension-driven flow (vector-valued PDE) and nematic ordering (tensor-valued PDE). The LMP method thus solves the long-standing problem of the interpolation of tensors on general surfaces with an optimal number of degrees of freedom.Comment: 16 pages, 6 figure

    Transport properties of bottomed mesons in a hot mesonic gas

    Full text link
    In this work we evaluate the B-meson drag and diffusion coefficients in a hot medium constituted of light mesons (pions, kaons and eta mesons). We treat the B-meson and B*-meson interaction with pseudo-Goldstone bosons in chiral perturbation theory at next-to-leading order within the constraints from heavy quark symmetry, and employ standard unitarization techniques of NLO amplitudes in order to account for dynamically generated resonances (leading to a more efficient heavy-flavor diffusion) and thus reach higher temperatures. We estimate individual meson contributions from the gas to the transport coefficients and perform a comparison with other findings in literature. We report a bottom relaxation length of about 80 fm at a temperature of 150 MeV and for typical momenta of 1 GeV, at which our approach is reliable. Compared to a charm relaxation length of 40 fm in the same conditions, we conclude that the B mesons provide a cleaner probe of the early stages of a heavy-ion collision.Comment: 14 pages, 16 figures, 3 tables. Version published in Phys.Rev.D87, 034019 (2013). Only minor improvements with respect to v1: corrected typos, further clarifications and updated reference

    A characterization of 3D steady Euler flows using commuting zero-flux homologies

    Full text link
    We characterize, using commuting zero-flux homologies, those volume-preserving vector fields on a 33-manifold that are steady solutions of the Euler equations for some Riemannian metric. This result extends Sullivan's homological characterization of geodesible flows in the volume-preserving case. As an application, we show that the steady Euler flows cannot be constructed using plugs (as in Wilson's or Kuperberg's constructions). Analogous results in higher dimensions are also proved.Comment: 16 pages, we added proofs of analogous results in higher dimensions, and a characterization of 3-dimensional Reeb field
    • …
    corecore